Algorithmic analysis of the multi-server system with a modified Bernoulli vacation schedule

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

/G/1 Queue With Modified Bernoulli Vacation Schedule And Un-Reliable Server Under N- Policy

ABSTARCT:This paper examines the steady state behavior of unreliable server in a batch arrival queue with two phases of heterogeneous service along with Bernoulli schedule and N-policy. The server provides two kinds of services in succession, the first stage service (FSS) followed by second stage service (SSS). As soon as both services are completed, the server may take a vacation or may contin...

متن کامل

ANALYSIS OF A DISCRETE-TIME IMPATIENT CUSTOMER QUEUE WITH BERNOULLI-SCHEDULE VACATION INTERRUPTION

This paper investigates a discrete-time impatient customer queue with Bernoulli-schedule vacation interruption. The  vacation times and the service times during regular busy period and during working vacation period are assumed to follow geometric distribution. We obtain the steady-state probabilities at arbitrary and outside observer's observation epochs using recursive technique. Cost analysi...

متن کامل

A SINGLE SERVER BERNOULLI VACATION QUEUE WITH TWO TYPE OF SERVICES AND WITH RESTRICTED ADMISSIBILITY

A single server queue with Bernoulli vacation has been considered. In addition the admission to queue is based on a Bernoulli process and the server gives two type of services. For this model the probability generating function for the number of customers in the queue at different server's state are obtained using supplementary variable technique. Some performance measures are calculated. Some ...

متن کامل

ON (A,C,B) POLICY QUEUE WITH CHANGE OVER TIMES UNDER BERNOULLI SCHEDULE VACATION INTERRUPTION

This paper analyzes a renewal input  working vacations queue with change over times and Bernoulli schedulevacation interruption under (a,c,b) policy.The service and vacation times are exponentially distributed.The server begins service if there are at least c units in the queue and the service takes place in batches with a minimum of size a and a maximum of size b (a

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematical Modelling

سال: 2011

ISSN: 0307-904X

DOI: 10.1016/j.apm.2010.11.019